Simplification of Articulated Meshes

نویسندگان

  • Eric Landreneau
  • Scott Schaefer
چکیده

We present a method for simplifying a polygonal character with an associated skeletal deformation such that the simplified character approximates the original shape well when deformed. As input, we require a set of example poses that are representative of the types of deformations the character undergoes and we produce a multiresolution hierarchy for the simplified character where all simplified vertices also have associated skin weights. We create this hierarchy by minimizing an error metric for a simplified set of vertices and their skin weights, and we show that this quartic error metric can be effectively minimized using alternating quadratic minimization for the vertices and weights separately. To enable efficient GPU accelerated deformations of the simplified character, we also provide a method that guarantees the maximum number of bone weights per simplified vertex is less than a user specified threshold at all levels of the hierarchy.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simplification and Real-time Smooth Transitions of Articulated Meshes

Simplification techniques have mainly been applied on static models. However in movie and game industries, many models are designed to be animated. We extend the progressive mesh technique to handle skeletallyarticulated meshes in order to obtain a continuous levelof-detail (CLOD) representation that retains its ability to be animated. Our technique is not limited to any simplification metric, ...

متن کامل

Multi-Layer Level of Detail For Character Animation

Real-time animation of human-like characters has been an active research area in computer graphics. Nowadays, more and more applications need to render various realistic scenes with human motion in crowds for interactive virtual environments. Animation and level of detail are well explored fields but little has been done to generate level of detail automatically for dynamic articulated meshes. ...

متن کامل

Fast and Accurate Hausdorff Distance Calculation between Meshes

Complex models generated e.g. with a laser range scanner often consist of several thousand or million triangles. For efficient rendering this high number of primitives has to be reduced. An important property of mesh reduction – or simplification – algorithms used for rendering is the control over the introduced geometric error. In general, the better this control is, the slower the simplificat...

متن کامل

Simplification of Arbitrary Polyhedral Meshes

Surface models containing billions of polygons are becoming more frequent in computer graphics. Mesh simplification is necessary for displaying such surfaces at interactive rates. We describe a novel method for simplifying polyhedral meshes while producing multiple levels of detail for progressive transmission and interactive exploration. Unlike previous work on mesh simplification, our method ...

متن کامل

Streaming Simplification of Tetrahedral Meshes

Unstructured tetrahedral meshes are commonly used in scientific computing to represent scalar, vector, and tensor fields in three dimensions. Visualization of these meshes can be difficult to perform interactively due to their size and complexity. By reducing the size of the data, we can accomplish real-time visualization necessary for scientific analysis. We propose a two-step approach for str...

متن کامل

Animation Model Simplifications

In this paper, we propose a new framework for the representation of deforming meshes by only updating necessary changes of the connectivity. The deforming meshes, which is also known as time-varying surfaces, are often constructed with static connectivity. To progressively represent the deforming meshes with level-of-details, people can simplify the meshes independently to obtain good simplific...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2009